________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:48:38
Input Data from:  dataset143.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,057
Average f[i]   :4300
Average g[i,j] :2084,3137254902
Total demand   :5800
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	1750	1	-1	16	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0    >new incumb.: 1750


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 53
> Selected Move:	2070	1	-1	13	10000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0    >new incumb.: 2070


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 57
> Selected Move:	2330	1	-1	17	14500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0    >new incumb.: 2330


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 99
> Selected Move:	2590	1	-1	18	19500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0    >new incumb.: 2590


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 114
> Selected Move:	2780	1	-1	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0    >new incumb.: 2780


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 63
> Selected Move:	2780	3	3	8	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 81
> Selected Move:	2760	3	18	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 52
> Selected Move:	2770	3	8	15	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 50
> Selected Move:	2760	3	4	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 63
> Selected Move:	2760	3	3	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 84
> Selected Move:	2750	3	15	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 51
> Selected Move:	2720	3	13	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 57
> Selected Move:	2750	3	10	18	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 101
> Selected Move:	2750	3	8	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 82
> Selected Move:	2730	3	18	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 53
> Selected Move:	2740	3	3	15	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 62
> Selected Move:	2730	3	4	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 82
> Selected Move:	2730	3	3	8	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 93
> Selected Move:	2730	3	15	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 62
> Selected Move:	2690	3	8	11	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 77
> Selected Move:	2720	3	12	13	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 61
> Selected Move:	2740	3	4	18	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 103
> Selected Move:	2740	3	11	15	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 98
> Selected Move:	2710	3	13	12	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 104
> Selected Move:	2710	3	15	11	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 109
> Selected Move:	2700	3	11	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 61
> Selected Move:	2720	3	18	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 56
> Selected Move:	2660	3	3	15	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 62
> Selected Move:	2690	3	10	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 50
> Selected Move:	2670	3	5	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 51
> Selected Move:	2700	3	12	13	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 42
> Selected Move:	2690	3	9	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 49
> Selected Move:	2670	3	10	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 97
> Selected Move:	2690	3	15	18	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 100
> Selected Move:	2670	3	14	6	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 102
> Selected Move:	2650	3	18	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 74
> Selected Move:	2670	3	6	14	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 67
> Selected Move:	2660	3	4	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 66
> Selected Move:	2640	3	14	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 70
> Selected Move:	2650	3	10	15	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 93
> Selected Move:	2660	3	6	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 54
> Selected Move:	2630	3	13	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 65
> Selected Move:	2650	3	15	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 62
> Selected Move:	2690	3	7	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 51
> Selected Move:	2660	3	9	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 106
> Selected Move:	2650	3	14	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 84
> Selected Move:	2640	3	4	6	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 105
> Selected Move:	2630	3	6	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 81
> Selected Move:	2610	3	18	15	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 78
> Selected Move:	2640	3	13	14	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 95
> Selected Move:	2640	3	15	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 80
> Selected Move:	2630	3	4	10	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 76
> Selected Move:	2610	3	14	6	24000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 86
> Selected Move:	2620	3	10	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 89
> Selected Move:	2620	3	4	15	22500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 101
> Selected Move:	2570	3	15	3	23000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 91
> Selected Move:	2640	3	6	11	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 90
> Selected Move:	2670	3	12	13	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 88
> Selected Move:	2670	3	3	8	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 94
> Selected Move:	2670	3	17	18	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 96
> Selected Move:	2670	3	8	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 84
> Selected Move:	2670	3	11	15	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 87
> Selected Move:	2670	3	3	8	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 98
> Selected Move:	2700	3	18	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 53
> Selected Move:	2670	3	13	12	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 55
> Selected Move:	2670	3	8	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 55
> Selected Move:	2640	3	4	18	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 102
> Selected Move:	2640	3	3	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 106
> Selected Move:	2640	3	15	11	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 102
> Selected Move:	2640	3	8	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 98
> Selected Move:	2620	3	18	4	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 71 #######################


> Neighbours evaluated; 52
> Selected Move:	2650	3	12	13	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 72 #######################


> Neighbours evaluated; 39
> Selected Move:	2675	3	11	17	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 73 #######################


> Neighbours evaluated; 73
> Selected Move:	2668	3	4	10	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 74 #######################


> Neighbours evaluated; 73
> Selected Move:	2650	3	3	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 75 #######################


> Neighbours evaluated; 95
> Selected Move:	2643	3	10	9	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 76 #######################


> Neighbours evaluated; 87
> Selected Move:	2650	3	18	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 77 #######################


> Neighbours evaluated; 82
> Selected Move:	2630	3	17	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 78 #######################


> Neighbours evaluated; 39
> Selected Move:	2620	3	9	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 79 #######################


> Neighbours evaluated; 63
> Selected Move:	2600	3	10	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 80 #######################


> Neighbours evaluated; 70
> Selected Move:	2620	3	15	17	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 81 #######################


> Neighbours evaluated; 103
> Selected Move:	2620	3	8	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 82 #######################


> Neighbours evaluated; 102
> Selected Move:	2620	3	17	18	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 83 #######################


> Neighbours evaluated; 105
> Selected Move:	2620	3	3	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 84 #######################


> Neighbours evaluated; 107
> Selected Move:	2605	3	14	10	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 85 #######################


> Neighbours evaluated; 104
> Selected Move:	2630	3	13	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 86 #######################


> Neighbours evaluated; 107
> Selected Move:	2620	3	10	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 87 #######################


> Neighbours evaluated; 96
> Selected Move:	2620	3	18	17	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 88 #######################


> Neighbours evaluated; 91
> Selected Move:	2640	3	9	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 89 #######################


> Neighbours evaluated; 102
> Selected Move:	2668	3	8	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 90 #######################


> Neighbours evaluated; 111
> Selected Move:	2660	3	12	13	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 91 #######################


> Neighbours evaluated; 113
> Selected Move:	2683	3	18	15	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 92 #######################


> Neighbours evaluated; 105
> Selected Move:	2635	3	15	8	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 93 #######################


> Neighbours evaluated; 103
> Selected Move:	2630	3	8	11	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 94 #######################


> Neighbours evaluated; 104
> Selected Move:	2610	3	5	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 95 #######################


> Neighbours evaluated; 95
> Selected Move:	2613	3	11	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 96 #######################


> Neighbours evaluated; 84
> Selected Move:	2620	3	13	12	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 97 #######################


> Neighbours evaluated; 91
> Selected Move:	2600	3	17	15	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 98 #######################


> Neighbours evaluated; 43
> Selected Move:	2600	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 99 #######################


> Neighbours evaluated; 35
> Selected Move:	2620	3	9	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 100 #######################


> Neighbours evaluated; 65
> Selected Move:	2605	3	12	13	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 101 #######################


> Neighbours evaluated; 63
> Selected Move:	2590	3	13	17	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 102 #######################


> Neighbours evaluated; 100
> Selected Move:	2640	3	5	4	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 103 #######################


> Neighbours evaluated; 101
> Selected Move:	2640	3	8	3	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 104 #######################


> Neighbours evaluated; 99
> Selected Move:	2665	3	17	13	25500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 105 #######################


> Neighbours evaluated; 69
> Selected Move:	2635	1	-1	17	30000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 106 #######################


> Neighbours evaluated; 95
> Selected Move:	2690	3	3	8	29500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 107 #######################


> Neighbours evaluated; 105
> Selected Move:	2738	3	4	18	28500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 108 #######################


> Neighbours evaluated; 124
> Selected Move:	2750	3	15	11	28000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 109 #######################


> Neighbours evaluated; 118
> Selected Move:	2738	3	13	12	27500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 110 #######################


> Neighbours evaluated; 124
> Selected Move:	2690	3	8	3	28000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 111 #######################


> Neighbours evaluated; 109
> Selected Move:	2668	3	12	13	28500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 112 #######################


> Neighbours evaluated; 100
> Selected Move:	2640	3	3	14	27500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 113 #######################


> Neighbours evaluated; 107
> Selected Move:	2640	3	13	12	27000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 114 #######################


> Neighbours evaluated; 105
> Selected Move:	2625	3	11	8	27500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 115 #######################


> Neighbours evaluated; 99
> Selected Move:	2640	3	18	15	27000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 116 #######################


> Neighbours evaluated; 88
> Selected Move:	2610	3	12	13	27500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 117 #######################


> Neighbours evaluated; 81
> Selected Move:	2578	3	14	6	27500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 118 #######################


> Neighbours evaluated; 81
> Selected Move:	2600	2	15	-1	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 119 #######################


> Neighbours evaluated; 101
> Selected Move:	2600	3	8	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 120 #######################


> Neighbours evaluated; 99
> Selected Move:	2600	3	17	18	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 121 #######################


> Neighbours evaluated; 102
> Selected Move:	2600	3	3	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 122 #######################


> Neighbours evaluated; 104
> Selected Move:	2585	3	6	9	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 123 #######################


> Neighbours evaluated; 75
> Selected Move:	2610	3	8	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 124 #######################


> Neighbours evaluated; 83
> Selected Move:	2580	3	9	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 125 #######################


> Neighbours evaluated; 106
> Selected Move:	2580	3	11	15	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 126 #######################


> Neighbours evaluated; 110
> Selected Move:	2610	3	18	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 127 #######################


> Neighbours evaluated; 61
> Selected Move:	2600	3	4	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 128 #######################


> Neighbours evaluated; 62
> Selected Move:	2600	3	15	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 129 #######################


> Neighbours evaluated; 58
> Selected Move:	2600	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 130 #######################


> Neighbours evaluated; 58
> Selected Move:	2650	3	14	11	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 131 #######################


> Neighbours evaluated; 69
> Selected Move:	2620	3	13	12	24000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 132 #######################


> Neighbours evaluated; 62
> Selected Move:	2640	3	4	17	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 133 #######################


> Neighbours evaluated; 102
> Selected Move:	2610	3	12	18	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 134 #######################


> Neighbours evaluated; 115
> Selected Move:	2610	3	8	3	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 135 #######################


> Neighbours evaluated; 111
> Selected Move:	2610	3	11	15	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 136 #######################


> Neighbours evaluated; 117
> Selected Move:	2620	1	-1	12	28500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 137 #######################


> Neighbours evaluated; 114
> Selected Move:	2675	3	3	8	28000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 138 #######################


> Neighbours evaluated; 124
> Selected Move:	2670	3	18	6	27000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 139 #######################


> Neighbours evaluated; 110
> Selected Move:	2670	3	6	4	29000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 140 #######################


> Neighbours evaluated; 107
> Selected Move:	2670	3	15	11	28500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 141 #######################


> Neighbours evaluated; 108
> Selected Move:	2650	3	12	13	29000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 142 #######################


> Neighbours evaluated; 98
> Selected Move:	2630	3	4	14	27000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 143 #######################


> Neighbours evaluated; 95
> Selected Move:	2655	3	11	18	28000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 144 #######################


> Neighbours evaluated; 101
> Selected Move:	2620	3	14	6	28000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 145 #######################


> Neighbours evaluated; 107
> Selected Move:	2618	3	13	12	27500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 146 #######################


> Neighbours evaluated; 105
> Selected Move:	2610	3	8	11	27000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 147 #######################


> Neighbours evaluated; 111
> Selected Move:	2583	3	12	13	27500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 148 #######################


> Neighbours evaluated; 103
> Selected Move:	2560	2	17	-1	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 149 #######################


> Neighbours evaluated; 105
> Selected Move:	2578	3	6	5	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 150 #######################


> Neighbours evaluated; 96
> Selected Move:	2600	3	13	12	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 151 #######################


> Neighbours evaluated; 102
> Selected Move:	2600	3	18	17	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 152 #######################


> Neighbours evaluated; 100
> Selected Move:	2580	3	5	9	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 153 #######################


> Neighbours evaluated; 90
> Selected Move:	2580	3	9	10	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 154 #######################


> Neighbours evaluated; 94
> Selected Move:	2610	3	12	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 155 #######################


> Neighbours evaluated; 95
> Selected Move:	2580	3	10	14	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 156 #######################


> Neighbours evaluated; 99
> Selected Move:	2590	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 157 #######################


> Neighbours evaluated; 85
> Selected Move:	2580	3	9	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 158 #######################


> Neighbours evaluated; 95
> Selected Move:	2560	3	14	3	26000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 159 #######################


> Neighbours evaluated; 80
> Selected Move:	2590	3	13	15	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 94
> Selected Move:	2590	3	15	12	25500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 161 #######################


> Neighbours evaluated; 95
> Selected Move:	2590	3	5	14	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 162 #######################


> Neighbours evaluated; 102
> Selected Move:	2605	1	-1	15	27500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 163 #######################


> Neighbours evaluated; 95
> Selected Move:	2605	3	12	13	28000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 164 #######################


> Neighbours evaluated; 94
> Selected Move:	2610	3	14	18	29000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 165 #######################


> Neighbours evaluated; 106
> Selected Move:	2585	3	3	14	28000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  1  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 166 #######################


> Neighbours evaluated; 104
> Selected Move:	2585	3	13	12	27500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 167 #######################


> Neighbours evaluated; 103
> Selected Move:	2578	3	18	6	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 168 #######################


> Neighbours evaluated; 89
> Selected Move:	2560	3	14	3	27500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 169 #######################


> Neighbours evaluated; 86
> Selected Move:	2550	2	17	-1	23000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 170 #######################


> Neighbours evaluated; 68
> Selected Move:	2590	3	6	10	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 171 #######################


> Neighbours evaluated; 66
> Selected Move:	2590	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 172 #######################


> Neighbours evaluated; 71
> Selected Move:	2570	3	10	14	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 173 #######################


> Neighbours evaluated; 71
> Selected Move:	2590	3	15	17	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 174 #######################


> Neighbours evaluated; 99
> Selected Move:	2590	3	17	18	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 175 #######################


> Neighbours evaluated; 105
> Selected Move:	2590	3	8	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 176 #######################


> Neighbours evaluated; 107
> Selected Move:	2570	3	14	6	23500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 177 #######################


> Neighbours evaluated; 106
> Selected Move:	2573	3	6	10	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 178 #######################


> Neighbours evaluated; 101
> Selected Move:	2600	3	12	17	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 179 #######################


> Neighbours evaluated; 113
> Selected Move:	2600	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 180 #######################


> Neighbours evaluated; 114
> Selected Move:	2610	3	10	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 181 #######################


> Neighbours evaluated; 110
> Selected Move:	2610	3	5	15	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 182 #######################


> Neighbours evaluated; 113
> Selected Move:	2570	3	8	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 183 #######################


> Neighbours evaluated; 115
> Selected Move:	2570	3	15	11	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 184 #######################


> Neighbours evaluated; 112
> Selected Move:	2570	3	11	3	25500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 185 #######################


> Neighbours evaluated; 106
> Selected Move:	2590	3	5	9	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 186 #######################


> Neighbours evaluated; 99
> Selected Move:	2585	3	17	12	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 187 #######################


> Neighbours evaluated; 91
> Selected Move:	2585	3	12	13	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 86
> Selected Move:	2600	3	9	10	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 189 #######################


> Neighbours evaluated; 111
> Selected Move:	2618	1	-1	17	30500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 190 #######################


> Neighbours evaluated; 109
> Selected Move:	2670	3	10	14	28500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  1  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 191 #######################


> Neighbours evaluated; 108
> Selected Move:	2655	3	13	12	28000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 192 #######################


> Neighbours evaluated; 105
> Selected Move:	2620	3	14	6	28000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 193 #######################


> Neighbours evaluated; 111
> Selected Move:	2603	3	3	15	27500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 120
> Selected Move:	2580	3	12	13	28000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  1  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 115
> Selected Move:	2585	3	18	3	28000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 86
> Selected Move:	2580	2	17	-1	23500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 60
> Selected Move:	2590	3	3	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 64
> Selected Move:	2580	3	4	8	23000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 199 #######################


> Neighbours evaluated; 64
> Selected Move:	2580	3	15	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 200 #######################


> Neighbours evaluated; 62
> Selected Move:	2580	3	8	3	25000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 201 #######################


> Neighbours evaluated; 58
> Selected Move:	2570	3	4	10	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 202 #######################


> Neighbours evaluated; 54
> Selected Move:	2590	3	6	14	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 203 #######################


> Neighbours evaluated; 57
> Selected Move:	2590	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 204 #######################


> Neighbours evaluated; 63
> Selected Move:	2570	3	8	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996
________________________________________________________________

Best solution found: 2780
Run Termination time: 03.02.2010 20:50:18
Run duration: 00:01:40.5312500
________________________________________________________________
